A Terr algorithm for computations in the infrastructure of real-quadratic number fields

نویسندگان

  • Ulrich VOLMER
  • Johannes Buchmann
  • Ulrich Volmer
چکیده

We show how to adapt Terr’s variant of the babystep giant-step algorithm of Shanks to the computation of the regulator and of generators of principal ideals in real-quadratic number fields. The worst case complexity of the resulting algorithm depends only on the square root of the regulator, and is smaller than that of all other previously specified unconditional deterministic algorithm for this task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the real quadratic fields with certain continued fraction expansions and fundamental units

The purpose of this paper is to investigate the real quadratic number fields $Q(sqrt{d})$ which contain the specific form of the continued fractions expansions of integral basis element  where $dequiv 2,3( mod  4)$ is a square free positive integer. Besides, the present paper deals with determining the fundamental unit$$epsilon _{d}=left(t_d+u_dsqrt{d}right) 2left.right > 1$$and  $n_d$ and $m_d...

متن کامل

Fast Ideal Arithmetic in Quadratic Fields

Ideal multiplication and reduction are fundamental operations on ideals and are used extensively in class group and infrastructure computations; hence, the efficiency of these operations is extremely important. In this thesis we focus on reduction in real quadratic fields and examine all of the known reduction algorithms, converting them whenever required to work with ideals of positive discrim...

متن کامل

Computational Aspects of NUCOMP

In 1989, Shanks introduced the NUCOMP algorithm [10] for computing the reduced composite of two positive definite binary quadratic forms of discriminant ∆. Essentially by applying reduction before composing the two forms, the intermediate operands are reduced from size O(∆) to O(∆) in most cases and at worst to O(∆). Shanks made use of this to extend the capabilities of his hand-held calculator...

متن کامل

The parallelized Pollard kangaroo method in real quadratic function fields

We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to the infrastructure in these fields. We also show how to speed up the computation by using heuristics on the distribution of the divisor class number, and by using the relatively inexpensive baby steps in the real quadratic mode...

متن کامل

Infrastructure in Real Quadratic Function Fields Infrastructure in Real Quadratic Function Fields

The principal topic of this article is to extend Shanks' infrastructure ideas in real quadratic number elds to the case of real quadratic congruence function elds. In this view, this paper is intended as a \low-brow" approach to the theory of ideals and operations in the ideal class group. We summarize some basic properties of ideals and provide elementary proofs of the main results. For the pu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007